منابع مشابه
Closed graphs are proper interval graphs
Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
متن کاملCutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
We give a linear-time algorithm to compute the cutwidth of threshold graphs, thereby resolving the computational complexity of cutwidth on this graph class. Although our algorithm is simple and intuitive, its correctness proof relies on a series of non-trivial structural results, and turns out to be surprisingly complex. Threshold graphs are a well-studied subclass of interval graphs and of spl...
متن کاملOpen - Interval Graphs versus Closed - Interval Grap
A graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bijection f:V--*F such that uv ~ E if and only iff(u)Nf(v)q=~. It is proved that if G is a countable graph then G can be represented by open intervals on the real line if and only if G can be represented by closed intervals on the real line, however, this is no longer true when G is an uncountable graph. S...
متن کاملComponent Coloring of Proper Interval Graphs and Split Graphs
We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of component coloring of graphs. Given a graph, the problem is to color the vertices using the minimum number of colors so that the size of each connected component of the subgraph induced by the vertices of the same color does not exceed C. We give a linear time algorithm for the problem ...
متن کاملProper interval graphs and the guard problem
This paper is a study of the hamiltonicity of proper interval graphs with applications to the guard problem in spiral polygons. We prove that proper interval graphs with ~> 2 vertices have hamiltonian paths, those with ~>3 vertices have hamiltonian cycles, and those with />4 vertices are hamiltonian-connected if and only if they are, respectively, 1-, 2-, or 3-connected. We also study the guard...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Analele Universitatii "Ovidius" Constanta - Seria Matematica
سال: 2014
ISSN: 1844-0835
DOI: 10.2478/auom-2014-0048